Efficient Optimization Using Experimental Queries

نویسندگان

  • Charles Baylis
  • Lawrence Dunleavy
  • Steven Lardizabal
  • Robert J. Marks
  • Alberto Rodriguez
چکیده

In the process of hardware optimization, physical queries requiring laboratory experiments are often necessary. This is similar to optimization using software where queries are made to a computer model. In both the laboratory optimization and optimization using computer models, queries come at a cost: laboratory time or computer time. Finding efficient searches using a small number of queries on average is therefore motivated. In this paper, techniques used in computer search are shown to be transparently applicable to certain instances of hardware optimization. The hardware example presented is a load-pull peaksearch algorithm for power amplifier load-impedance optimization. The successful search shown in this paper allows high-resolution measurement of the maximum power with a significant reduction in the number of measured reflection-coefficient states. The use of computationally intelligent procedures for reducing time costs in design optimization using hardware has significant potential applications in a number of iterative experimental procedures performed in the laboratory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

Efficient Evaluation of Continuous Range Queries on Moving Objects

Abstract. In this paper we evaluate several in-memory algorithms for efficient and scalable processing of continuous range queries over collections of moving objects. Constant updates to the index are avoided by query indexing. No constraints are imposed on the speed or path of moving objects. We present a detailed analysis of a grid approach which shows the best results for both skewed and uni...

متن کامل

Efficient Execution of Multi-query Data Analysis Batches Using Compiler Optimization Strategies

This work investigates the leverage that can be obtained from compiler optimization techniques for efficient execution of multi-query workloads in data analysis applications. Our approach is to address multi-query optimization at the algorithmic level, by transforming a declarative specification of scientific data analysis queries into a high-level imperative program that can be made more effic...

متن کامل

Efficient Cost Models for Spatial Queries Using R-Trees

ÐSelection and join queries are fundamental operations in Data Base Management Systems (DBMS). Support for nontraditional data, including spatial objects, in an efficient manner is of ongoing interest in database research. Toward this goal, access methods and cost models for spatial queries are necessary tools for spatial query processing and optimization. In this paper, we present analytical m...

متن کامل

Efficient processing of enumerative set-based queries

Many applications often require finding sets of entities of interest that meet certain constraints. Such set-based queries (SQs) can be broadly classified into two types: optimization SQs that involve some optimization constraint and enumerative SQs that do not have any optimization constraint. While there has been much research on the evaluation of optimization SQs, there is very little work o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011